A closed graph theorem for hyperbolic iterated function systems

نویسندگان

چکیده

In this note we introduce a notion of morphism between two hyperbolic iterated function systems. We prove that the graph is attractor an system, giving Closed Graph Theorem, and show how it can be used to approach topological conjugacy problem for

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Characterization of Hyperbolic Affine Iterated Function Systems

The two main theorems of this paper provide a characterization of hyperbolic affine iterated function systems defined on R. Atsushi Kameyama [Distances on topological self-similar sets, in Fractal Geometry and Applications: A Jubilee of Benǒit Mandelbrot. Proceedings of Symposia in Pure Mathematics, Volume 72, Part 1, 2004, pages 117–129] asked the following fundamental question: Given a topolo...

متن کامل

An analogue of Cobham's theorem for graph directed iterated function systems

Feng and Wang showed that two homogeneous iterated function systems in R with multiplicatively independent contraction ratios necessarily have different attractors. In this paper, we extend this result to graph directed iterated function systems in R with contraction ratios that are of the form 1 β , for integers β. By using a result of Boigelot et al., this allows us to give a proof of a conje...

متن کامل

Iterated function systems with symmetry in the hyperbolic plane

Images are created using probabilistic iterated function systems that involve both affine transformations of the plane and isometries of hyperbolic geometry. Figures of attractors with striking hyperbolic symmetry are the result.

متن کامل

On the Relation between Iterated Function Systems and Partitioned Iterated Function Systems on the Relation between Iterated Function Systems and Partitioned Iterated Function Systems on the Relation between Iterated Function Systems and Partitioned Iterated Function Systems

In this paper, we give a theoretically founded transition from Iterated Function Systems based on aane transformations to Partitioned Iterated Function Systems. We show that there are two essential steps, namely, restricting the aane transformations, and solving the evoked problem of ink dissipation. In this paper, we give a theoretically founded transition from Iterated Function Systems based ...

متن کامل

Rotation number and its properties for iterated function and non-autonomous systems  

The main purpose of this paper is to introduce the rotation number for non-autonomous and iterated function systems. First, we define iterated function systems and the lift of these types of systems on the unit circle. In the following, we define the rotation number and investigate the conditions of existence and uniqueness of this number for our systems. Then, the notions rotational entropy an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of fractal geometry

سال: 2022

ISSN: ['2308-1309', '2308-1317']

DOI: https://doi.org/10.4171/jfg/116